Secure multiparty quantum computation with few qubits
نویسندگان
چکیده
منابع مشابه
Power of Quantum Computation with Few Clean Qubits
This paper investigates the power of polynomial-time quantum computation in which only a very limited number of qubits are initially clean in the |0〉 state, and all the remaining qubits are initially in the totally mixed state. No initializations of qubits are allowed during the computation, nor are intermediate measurements. The main contribution of this paper is to develop unexpectedly strong...
متن کاملSecure Multiparty Computation
A function is private if there exists a protocol that is secure; that is, no party can learn any additional information about the other parties’ inputs other than what follows from their own input and the function’s output. Previous studies have investigated multiparty computation with broadcast communication, but broadcast communication does not fully capture all secure multiparty protocols. W...
متن کاملSecure Multiparty Computation
Assume a number of parties want to compute a public function F (x1, . . . , xn) = (y1, . . . , yn). All of them want to get the correct answer, but none of them are willing to expose their secret inputs to other parties. One way to achieve this requirement is to implement the secure multiparty computation protocols. In this paper, we will make a brief introduction to secure multiparty computati...
متن کاملScalable Secure Multiparty Computation
We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settings even vanishes, with the number of players. Our protocol is secure against an active adversary which may adaptively corrupt up to some constant fraction of the players. The protocol can be implemented in a constant ...
متن کاملSecure Multiparty Computation with Minimal Interaction
We revisit the question of secure multiparty computation (MPC) with two rounds of interaction. It was previously shown by Gennaro et al. (Crypto 2002) that 3 or more communication rounds are necessary for general MPC protocols with guaranteed output delivery, assuming that there may be t ≥ 2 corrupted parties. This negative result holds regardless of the total number of parties, even if broadca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2020
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.102.022405